A computability theoretic equivalent to Vaught’s conjecture
نویسندگان
چکیده
منابع مشابه
A Computability Theoretic Equivalent to Vaught’s Conjecture
We prove that, for every theory T which is given by an Lω1,ω sentence, T has less than 2א0 many countable models if and only if we have that, for every X ∈ 2 on a cone of Turing degrees, every X-hyperarithmetic model of T has an X-computable copy. We also find a concrete description, relative to some oracle, of the Turing-degree spectra of all the models of a counterexample to Vaught’s conjecture.
متن کاملConstraint Problems: Computability Is Equivalent to Continuity
In many practical situations, we would like to compute the set of all possible values that satisfy given constraints. It is known that even for computable (constructive) constraints, computing such set is not always algorithmically possible. One reason for this algorithmic impossibility is that sometimes, the dependence of the desired set on the parameters of the problem is not continuous, whil...
متن کاملComputability-theoretic learning complexity.
Initially discussed are some of Alan Turing's wonderfully profound and influential ideas about mind and mechanism-including regarding their connection to the main topic of the present study, which is within the field of computability-theoretic learning theory. Herein is investigated the part of this field concerned with the algorithmic, trial-and-error inference of eventually correct programs f...
متن کاملA Domain-Theoretic Approach to Computability on the Real Line
In recent years, there has been a considerable amount of work on using continuous domains in real analysis. Most notably are the development of the generalized Riemann integral with applications in fractal geometry, several extensions of the programming language PCF with a real number data type, and a framework and an implementation of a package for exact real number arithmetic. Based on recurs...
متن کاملEmergence as a computability-theoretic phenomenon
In dealing with emergent phenomena, a common task is to identify useful descriptions of them in terms of the underlying atomic processes, and to extract enough computational content from these descriptions to enable predictions to be made. Generally, the underlying atomic processes are quite well understood, and (with important exceptions) captured by mathematics from which it is relatively eas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2013
ISSN: 0001-8708
DOI: 10.1016/j.aim.2012.11.012